Synchronizing series-parallel deterministic finite automata with loops and related problems
نویسندگان
چکیده
We study the problem DFA-SW of determining if a given deterministic finite automaton A possesses synchronizing word length at most k for automata whose (multi-)graphs are TTSPL, i.e. , series-parallel, plus allowing some self-loops. While remains NP-complete on TTSPL automata, we also find (further) restrictions with efficient (parameterized) algorithms. complexity related problems, instance, extension variants problem, or finding smallest alphabet-induced synchronizable sub-automata.
منابع مشابه
Synchronizing non-deterministic finite automata
In this paper, we show that every D3-directing CNFA can be mapped uniquely to a DFA with the same synchronizing word length. This implies that Černý’s conjecture generalizes to CNFAs and that the general upper bound for the length of a shortest D3-directing word is equal to the Pin-Frankl bound for DFAs. As a second consequence, for several classes of CNFAs sharper bounds are established. Final...
متن کاملExtending word problems in deterministic finite automata
A word w is extending a subset of states S of a deterministic finite automaton, if the set of states mapped to S by w (the preimage of S under the action of w) is larger than S. This notion together with its variations has particular importance in the field of synchronizing automata, where a number of methods and algorithms rely on finding (short) extending words. In this paper we study the com...
متن کاملMINIMIZATION OF DETERMINISTIC FINITE AUTOMATA WITH VAGUE (FINAL) STATES AND INTUITIONISTIC FUZZY (FINAL) STATES
In this paper, relations among the membership values of gener- alized fuzzy languages such as intuitionistic fuzzy language, interval-valued fuzzy language and vague language are studied. It will aid in studying the properties of one language when the properties of another are known. Further, existence of a minimized nite automaton with vague ( final) states for any vague regular language recog...
متن کاملParallel Algorithms for Finite Automata Problems
Finite automata are among the most extensively studied and well understood models of computation. They have wide ranging applications for example, in image compression, protocol validation, game theory and computational biology just to mention only some recent ones. Here we will attempt to present a comprehensive survey of parallel algorithms for many fundamental computational problems on nite ...
متن کاملFailure Deterministic Finite Automata
Inspired by failure functions found in classical pattern matching algorithms, a failure deterministic finite automaton (FDFA) is defined as a formalism to recognise a regular language. An algorithm, based on formal concept analysis, is proposed for deriving from a given deterministic finite automaton (DFA) a language-equivalent FDFA. The FDFA’s transition diagram has fewer arcs than that of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Informatics and Applications
سال: 2021
ISSN: ['0988-3754', '1290-385X']
DOI: https://doi.org/10.1051/ita/2021005